Analysis of Generalized LDPC Codes with Random Component Codes for the Binary Erasure Channel
نویسندگان
چکیده
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes on the binary erasure channel (BEC) is proposed. The considered GLDPC codes have block linear codes as check nodes. Instead of considering specific check component codes, like Hamming or BCH codes, random codes are considered, and a technique is developed for obtaining the expected check EXIT function for the overall GLDPC code. Each check component code is supposed to belong to an expurgated ensemble. Some GLDPC thresholds obtained by this technique are compared with those of GLDPC codes, with the same distribution and component codes lengths, using specific codes. Results obtained by combining our analysis with differential evolution tool are also presented.
منابع مشابه
Analysis of Doubly-Generalized LDPC Codes with Random Component Codes for the Binary Erasure Channel
A method for the asymptotic analysis of doublygeneralized low-density parity-check (D-GLDPC) codes on the binary erasure channel (BEC) is described. The proposed method is based on extrinsic information transfer (EXIT) charts. It permits to overcome the impossibility to evaluate the EXIT function for the check or variable component codes, in situations where the information functions or split i...
متن کاملOn the erasure-correcting capabilities of low-complexity decoded LDPC codes with constituent Hamming codes
Low-density parity-check (LDPC) codes can be constructed using constituent block codes other than single parity-check (SPC) codes. This paper considers random LDPC codes with constituent Hamming codes and investigates their asymptotic performance over the binary erasure channel. It is shown that there exist Hamming code-based LDPC codes which, when decoded with a low-complexity iterative algori...
متن کاملFinite-length analysis of low-density parity-check codes on the binary erasure channel
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expression for the exact average bit and block erasure probability for a given regular ensemble of LDPC codes when decoded iteratively. We also give expressions for upper bounds on the average bit and block erasure probab...
متن کاملAnalysis of thresholds for braided block codes in BEC
Low-density parity-check (LDPC) codes, invented by Gallager [2], who described and analyzed a block variant of the codes, arouse great interest of researchers. These codes are widely used in practice since they can be decoded by using relatively simple iterative decoding algorithms. Several modifications of these codes are known, in particular, generalized LDPC codes [3]. In contrast to Gallage...
متن کاملProtograph LDPC Codes with Block Thresholds: Extension to Degree-1 and Generalized Nodes
Protograph low-density-parity-check (LDPC) are considered to design near-capacity lowrate codes over the binary erasure channel (BEC) and binary additive white Gaussian noise (BIAWGN) channel. For protographs with degree-one variable nodes and doubly-generalized LDPC (DGLDPC) codes, conditions are derived to ensure equality of bit-error threshold and block-error threshold. Using this condition,...
متن کامل